منابع مشابه
Isoperimetric Functions of Amalgamations of Nilpotent Groups
We consider amalgamations of nitely generated nilpotent groups of class c. We show that doubles satisfy a polynomial isoperimetric inequality of degree 2c. Generalising doubles we introduce non-twisted amalgamations and show that they satisfy a polynomial isoperimetric inequality as well. We give a su cient condition for amalgamations along abelian subgroups to be non-twisted and thereby to sat...
متن کاملAmalgamations of Lattice Ordered Groups
The author considers the problem of determining whether certain classes of lattice ordered groups (¿-groups) have the amalgamation property. It is shown that the classes of abelian totally ordered groups (ogroups) and abelian /-groups have the property, but that the class of ¿-groups does not. However, under certain cardinality restrictions one can find an ¿-group which is the "product" of /-gr...
متن کاملAmalgamations and the Kervaire Problem
Following S. Brick, a 2-complex X is called "Kervaire" if all systems of equations, with coefficients in arbitrary groups G and the attaching maps of X as the words in the variable letters, are solvable in an over group of G. An obstruction theory is developed for solving equations modeled on Z = Xp Y, where X and Y are Kervaire 2-complexes and T is a subgraph of Z^\ each connected component of...
متن کاملAmalgamations and Link Graphs of Cayley Graphs
The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups with amalgamated subgroups, we give a sufficient condition for a class of link graphs of Cayley graph...
متن کاملGenus distributions of graphs under edge-amalgamations
We present a general method for calculating the genus distributions of those infinite families of graphs that are obtained by iteratively amalgamating copies of some base graphs along their root-edges. We presume that the partitioned genus distributions of these base graphs are known and that their root-edges have 2-valent endpoints. We analyze and adapt the use of recombinant strands, partials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1999
ISSN: 0021-8693
DOI: 10.1006/jabr.1999.7944